0.05/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.05/0.11 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.11/0.31 % Computer : n010.cluster.edu 0.11/0.31 % Model : x86_64 x86_64 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.31 % Memory : 8042.1875MB 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.31 % CPULimit : 1200 0.11/0.31 % WCLimit : 120 0.11/0.31 % DateTime : Tue Jul 13 12:29:51 EDT 2021 0.11/0.32 % CPUTime : 0.11/0.32 % Number of cores: 8 0.11/0.32 % Python version: Python 3.6.8 0.11/0.32 # Version: 2.6rc1-ho 0.11/0.32 # No SInE strategy applied 0.11/0.32 # Trying AutoSched0 for 59 seconds 0.56/0.86 # AutoSched0-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN 0.56/0.86 # and selection function SelectComplexExceptUniqMaxHorn. 0.56/0.86 # 0.56/0.86 # Preprocessing time : 0.027 s 0.56/0.86 # Presaturation interreduction done 0.56/0.86 0.56/0.86 # Proof found! 0.56/0.86 # SZS status Theorem 0.56/0.86 # SZS output start CNFRefutation 0.56/0.86 thf(thm, conjecture, ?[X3:($i > $i) > $i > $i]:(plus @ X3 @ three)=(three), file('/export/starexec/sandbox/benchmark/theBenchmark.p', thm)). 0.56/0.86 thf(zero_ax, axiom, (zero)=(^[X1:$i > $i, X2:$i]:X2), file('/export/starexec/sandbox/benchmark/Axioms/NUM006^0.ax', zero_ax)). 0.56/0.86 thf(plus_ax, axiom, (plus)=(^[X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:X4 @ X1 @ (X3 @ X1 @ X2)), file('/export/starexec/sandbox/benchmark/Axioms/NUM006^0.ax', plus_ax)). 0.56/0.86 thf(c_0_3, negated_conjecture, ~(?[X3:($i > $i) > $i > $i]:(plus @ X3 @ three)=(three)), inference(assume_negation,[status(cth)],[thm])). 0.56/0.86 thf(c_0_4, negated_conjecture, ![X39:($i > $i) > $i > $i]:(plus @ X39 @ three)!=(three), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])). 0.56/0.86 thf(c_0_5, plain, ![X1:$i > $i, X2:$i]:(zero @ X1 @ X2)=(X2), inference(fof_simplification,[status(thm)],[zero_ax])). 0.56/0.86 thf(c_0_6, plain, ![X4:($i > $i) > $i > $i, X3:($i > $i) > $i > $i, X1:$i > $i, X2:$i]:(plus @ X4 @ X3 @ X1 @ X2)=(X4 @ X1 @ (X3 @ X1 @ X2)), inference(fof_simplification,[status(thm)],[plus_ax])). 0.56/0.86 thf(c_0_7, negated_conjecture, ![X3:($i > $i) > $i > $i]:(plus @ X3 @ three)!=(three), inference(split_conjunct,[status(thm)],[c_0_4])). 0.56/0.86 thf(c_0_8, plain, ![X6:$i > $i, X7:$i]:(zero @ X6 @ X7)=(X7), inference(variable_rename,[status(thm)],[c_0_5])). 0.56/0.86 thf(c_0_9, plain, ![X31:($i > $i) > $i > $i, X32:($i > $i) > $i > $i, X33:$i > $i, X34:$i]:(plus @ X31 @ X32 @ X33 @ X34)=(X31 @ X33 @ (X32 @ X33 @ X34)), inference(variable_rename,[status(thm)],[c_0_6])). 0.56/0.86 thf(c_0_10, negated_conjecture, ![X3:($i > $i) > $i > $i]:(plus @ X3 @ three @ (esk1_2 @ X3))!=(three @ (esk1_2 @ X3)), inference(neg_ext,[status(thm)],[c_0_7])). 0.56/0.86 thf(c_0_11, plain, ![X1:$i > $i, X2:$i]:(zero @ X1 @ X2)=(X2), inference(split_conjunct,[status(thm)],[c_0_8])). 0.56/0.86 thf(c_0_12, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X4:($i > $i) > $i > $i, X2:$i]:(plus @ X3 @ X4 @ X1 @ X2)=(X3 @ X1 @ (X4 @ X1 @ X2)), inference(split_conjunct,[status(thm)],[c_0_9])). 0.56/0.86 thf(c_0_13, negated_conjecture, ![X3:($i > $i) > $i > $i]:(plus @ X3 @ three @ (esk1_2 @ X3) @ (esk3_1 @ X3))!=(three @ (esk1_2 @ X3) @ (esk3_1 @ X3)), inference(neg_ext,[status(thm)],[c_0_10])). 0.56/0.86 thf(c_0_14, plain, ![X1:$i > $i, X3:($i > $i) > $i > $i, X2:$i]:(plus @ zero @ X3 @ X1 @ X2)=(X3 @ X1 @ X2), inference(spm,[status(thm)],[c_0_11, c_0_12])). 0.56/0.86 thf(c_0_15, negated_conjecture, ($false), inference(spm,[status(thm)],[c_0_13, c_0_14]), ['proof']). 0.56/0.86 # SZS output end CNFRefutation 0.56/0.86 # Proof object total steps : 16 0.56/0.86 # Proof object clause steps : 7 0.56/0.86 # Proof object formula steps : 9 0.56/0.86 # Proof object conjectures : 7 0.56/0.86 # Proof object clause conjectures : 4 0.56/0.86 # Proof object formula conjectures : 3 0.56/0.86 # Proof object initial clauses used : 3 0.56/0.86 # Proof object initial formulas used : 3 0.56/0.86 # Proof object generating inferences : 2 0.56/0.86 # Proof object simplifying inferences : 0 0.56/0.86 # Training examples: 0 positive, 0 negative 0.56/0.86 # Parsed axioms : 29 0.56/0.86 # Removed by relevancy pruning/SinE : 0 0.56/0.86 # Initial clauses : 29 0.56/0.86 # Removed in clause preprocessing : 14 0.56/0.86 # Initial clauses in saturation : 15 0.56/0.86 # Processed clauses : 2390 0.56/0.86 # ...of these trivial : 233 0.56/0.86 # ...subsumed : 875 0.56/0.86 # ...remaining for further processing : 1282 0.56/0.86 # Other redundant clauses eliminated : 975 0.56/0.86 # Clauses deleted for lack of memory : 0 0.56/0.86 # Backward-subsumed : 8 0.56/0.86 # Backward-rewritten : 89 0.56/0.86 # Generated clauses : 41004 0.56/0.86 # ...of the previous two non-trivial : 36934 0.56/0.86 # Contextual simplify-reflections : 2 0.56/0.86 # Paramodulations : 33056 0.56/0.86 # Factorizations : 0 0.56/0.86 # NegExts : 2292 0.56/0.86 # Equation resolutions : 975 0.56/0.86 # Propositional unsat checks : 0 0.56/0.86 # Propositional check models : 0 0.56/0.86 # Propositional check unsatisfiable : 0 0.56/0.86 # Propositional clauses : 0 0.56/0.86 # Propositional clauses after purity: 0 0.56/0.86 # Propositional unsat core size : 0 0.56/0.86 # Propositional preprocessing time : 0.000 0.56/0.86 # Propositional encoding time : 0.000 0.56/0.86 # Propositional solver time : 0.000 0.56/0.86 # Success case prop preproc time : 0.000 0.56/0.86 # Success case prop encoding time : 0.000 0.56/0.86 # Success case prop solver time : 0.000 0.56/0.86 # Current number of processed clauses : 1170 0.56/0.86 # Positive orientable unit clauses : 155 0.56/0.86 # Positive unorientable unit clauses: 9 0.56/0.86 # Negative unit clauses : 8 0.56/0.86 # Non-unit-clauses : 998 0.56/0.86 # Current number of unprocessed clauses: 34476 0.56/0.86 # ...number of literals in the above : 96795 0.56/0.86 # Current number of archived formulas : 0 0.56/0.86 # Current number of archived clauses : 112 0.56/0.86 # Clause-clause subsumption calls (NU) : 139702 0.56/0.86 # Rec. Clause-clause subsumption calls : 107681 0.56/0.86 # Non-unit clause-clause subsumptions : 884 0.56/0.86 # Unit Clause-clause subsumption calls : 12 0.56/0.86 # Rewrite failures with RHS unbound : 0 0.56/0.86 # BW rewrite match attempts : 847 0.56/0.86 # BW rewrite match successes : 72 0.56/0.86 # Condensation attempts : 0 0.56/0.86 # Condensation successes : 0 0.56/0.86 # Termbank termtop insertions : 448669 0.56/0.86 0.56/0.86 # ------------------------------------------------- 0.56/0.86 # User time : 0.476 s 0.56/0.86 # System time : 0.026 s 0.56/0.86 # Total time : 0.502 s 0.56/0.86 # Maximum resident set size: 1672 pages 0.56/0.86 EOF